The normalized Laplacian spectrum of subdivisions of a graph
نویسندگان
چکیده
منابع مشابه
Normalized laplacian spectrum of two new types of join graphs
Let $G$ be a graph without an isolated vertex, the normalized Laplacian matrix $tilde{mathcal{L}}(G)$ is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$, where $mathcal{D}$ is a diagonal matrix whose entries are degree of vertices of $G$. The eigenvalues of $tilde{mathcal{L}}(G)$ are called as the normalized Laplacian eigenva...
متن کاملOn the spectrum of the normalized graph Laplacian
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this spectrum under local and global operations like motif doubling, graph joining or splitting. The eigenvalue 1 plays a particular role, and we therefore emphasize tho...
متن کاملnormalized laplacian spectrum of two new types of join graphs
let $g$ be a graph without an isolated vertex, the normalized laplacian matrix $tilde{mathcal{l}}(g)$is defined as $tilde{mathcal{l}}(g)=mathcal{d}^{-frac{1}{2}}mathcal{l}(g) mathcal{d}^{-frac{1}{2}}$, where $mathcal{d}$ is a diagonal matrix whose entries are degree of vertices of $g$. the eigenvalues of$tilde{mathcal{l}}(g)$ are called as the normalized laplacian ...
متن کاملThe Laplacian spectrum of a mixed graph
In this paper, we discuss some properties of relations between a mixed graph and its line graph, which are used to characterize the Laplacian spectrum of a mixed graph. Then we present two sharp upper bounds for the Laplacian spectral radius of a mixed graph in terms of the degrees and the average 2-degrees of vertices and we also determine some extreme graphs which attain these upper bounds. ©...
متن کاملLaplacian Sum-Eccentricity Energy of a Graph
We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2016
ISSN: 0096-3003
DOI: 10.1016/j.amc.2016.04.033